Distributed Nonsmooth Optimization With Coupled Inequality Constraints via Modified Lagrangian Function
نویسندگان
چکیده
منابع مشابه
Linear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملBayesian Optimization with Inequality Constraints
Bayesian optimization is a powerful framework for minimizing expensive objective functions while using very few function evaluations. It has been successfully applied to a variety of problems, including hyperparameter tuning and experimental design. However, this framework has not been extended to the inequality-constrained optimization setting, particularly the setting in which evaluating feas...
متن کاملlinear objective function optimization with the max-product fuzzy relation inequality constraints
in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملControl via Nonsmooth Optimization ∗
We present a new approach to mixed H 2 /H∞ output feedback control synthesis. Our method uses nonsmooth mathematical programming techniques to compute locally optimal H 2 /H∞-controllers, which may have a predefined structure. We prove global convergence of our method and present tests to validate it numerically. 1. Introduction. Mixed H 2 /H ∞ output feedback control is a prominent example of ...
متن کاملNonsmooth Optimization via Bfgs
We investigate the BFGS algorithm with an inexact line search when applied to nonsmooth functions, not necessarily convex. We define a suitable line search and show that it generates a sequence of nested intervals containing points satisfying the Armijo and weak Wolfe conditions, assuming only absolute continuity. We also prove that the line search terminates for all semi-algebraic functions. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2018
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2017.2752001